The effect of the initial network configuration on preferential attachment
نویسندگان
چکیده
The classical preferential attachment model is sensitive to the choice of the initial configuration of the network. As the number of initial nodes and their degree grow, so does the time needed for an equilibrium degree distribution to be established. We study this phenomenon, provide estimates of the equilibration time, and characterize the degree distribution cutoff observed at finite times. When the initial network is dense and exceeds a certain small size, there is no equilibration and a suitable statistical test can always discern the produced degree distribution from the equilibrium one. As a by-product, the weighted Kolmogorov-Smirnov statistic is demonstrated to be more suitable for statistical analysis of power-law distributions with cutoff when the data is ample.
منابع مشابه
The effect of supply network configuration on occurring chaotic behavior in the retailer’s inventory
ToToday’s market place is increasingly dynamic and volatile. In this area supply network issues recently have attracted a lot of attention from industrial practitioners and academics worldwide. Chaos theory is the study of complex, nonlinear, dynamic systems. For chaotic systems, a tiny change in conditions may result in an enormous change in system output, whereas substantial changes in condit...
متن کاملSublinear but Never Superlinear Preferential Attachment by Local Network Growth
We investigate a class of network growth rules that are based on a redirection algorithm wherein new nodes are added to a network by linking to a randomly chosen target node with some probability 1− r or linking to the parent node of the target node with probability r. For fixed 0 < r < 1, the redirection algorithm is equivalent to linear preferential attachment. We show that when r is a decayi...
متن کاملNetwork Growth with Arbitrary Initial Conditions: Analytical Results for Uniform and Preferential Attachment
This paper provides time-dependent expressions for the expected degree distribution of a given network that is subject to growth, as a function of time. We consider both uniform attachment, where incoming nodes form links to existing nodes selected uniformly at random, and preferential attachment, when probabilities are assigned proportional to the degrees of the existing nodes. We consider the...
متن کاملNetwork growth with arbitrary initial conditions: degree dynamics for uniform and preferential attachment.
This paper provides time-dependent expressions for the expected degree distribution of a given network that is subject to growth. We consider both uniform attachment, where incoming nodes form links to existing nodes selected uniformly at random, and preferential attachment, where probabilities are assigned proportional to the degrees of the existing nodes. We consider the cases of single and m...
متن کاملPreferential attachment mechanism of complex network growth: "rich-gets-richer" or "fit-gets-richer"?
We analyze the growth models for complex networks including preferential attachment (A.-L. Barabasi and R. Albert, Science 286, 509 (1999)) and fitness model (Caldarelli et al., Phys. Rev. Lett. 89, 258702 (2002)) and demonstrate that, under very general conditions, these two models yield the same dynamic equation of network growth, dK dt = A(t)(K +K0), where A(t) is the aging constant, K is th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1305.0205 شماره
صفحات -
تاریخ انتشار 2013